
Adaptive Sniping for Volatile and Stable Continuous Double Auction Markets.

Learning Classifier System Ensembles With Rule%2DSharing.

Super Computer Heterogeneous Classifier Meta%2DEnsembles.

A Comparison of DWT%2FPAA and DFT for Time Series Classification.

Variance Stabilizing Regression Ensembles for Environmental Models.

Autonomous Adaptive Agents for Single Seller Sealed Bid Auctions.
 In developing open, heterogeneous and distributed multi-agent systems researchers often face a problem of facilitating negotiation and bargaining amongst agents. It is increasingly common to use auction mechanisms for negotiation in multi-agent systems. The choice of auction mechanism and the bidding strategy of an agent are of central importance to the success of the agent model. Our aim is to determine the best agent learning algorithm for bidding in a variety of single seller auction structures in both static environments where a known optimal strategy exists and in complex environments where the optimal strategy may be constantly changing. In this paper we present a model of single seller auctions and describe three adaptive agent algorithms to learn strategies through repeated competition. We experiment in a range of auction environments of increasing complexity to determine how well each agent performs, in relation to an optimal strategy in cases where one can be deduced, or in relation to each other in other cases. We find that, with a uniform value distribution, a purely reactive agent based on Cliff’s ZIP algorithm for continuous double auctions (CDA) performs well, although is outperformed in some cases by a memory based agent based on the Gjerstad Dickhaut agent for CDA.  
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity.
Abstract. Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper we argue that clipping is a useful and flexible transformation for the exploratory analysis of large time dependent data sets. We demonstrate how time series stored as bits can be very efficiently compressed and manipulated and that, under some assumptions, the discriminatory power with clipped series is asymptotically equivalent to that achieved with the raw data. Unlike other transformations, clipped series can be compared directly to the raw data series. We show that this means we can form a tight lower bounding metric for Euclidean and Dynamic Time Warping distance and hence efficiently query by content. Clipped data can be used in conjunction with a host of algorithms and statistical tests that naturally follow from the binary nature of the data. A series of experiments illustrate how clipped series can be used in increasingly complex ways to achieve better results than with other popular techniques. The usefulness of the representation is demonstrated by the fact that the results with clipped data are consistently better than those achieved with a Wavelet or Discrete Fourier Transformation at the same compression ratio for both clustering and query by content. The flexibility of the representation is shown by the fact that we can take advantage of a variable run length encoding of clipped series to define an approximation of the Kolmogorov complexity and hence perform
AgentP classifier system self%2Dadjusting vs. gradual approach.

AgentP classifier system self%2Dadjusting vs. gradual approach.



A Likelihood Ratio Distance Measure for the Similarity Between the Fourier Transform of Time Series.

A Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering.
Abstract. Because time series are a ubiquitous and increasingly prevalent type of data, there has been much research effort devoted to time series data mining recently. As with all data mining problems, the key to effective and scalable algorithms is choosing the right representation of the data. Many high level representations of time series have been proposed for data mining. In this work, we introduce a new technique based on a bit level approximation of the data. The representation has several important advantages over existing techniques. One unique advantage is that it allows raw data to be directly compared to the reduced representation, while still guaranteeing lower bounds to Euclidean distance. This fact can be exploited to produce faster exact algorithms for similarly search. In addition, we demonstrate that our new representation allows time series clustering to scale to much larger datasets. 1
A multiagent model of the UK market in electricity generation.

Clustering Time Series with Clipped Data.

Improving Decision Tree Performance Through Induction%2D and Cluster%2DBased Stratified Sampling.

Clustering time series from ARMA models with clipped data.

An Agent Model for First Price and Second Price Private Value Auctions.


The next release problem.
This paper is concerned with the Multi-Objective Next Release Problem (MONRP), a problem in search-based requirements engineering. Previous work has considered only single objective formulations. In the multi-objective formulation, there are at least two (possibly conflicting) objectives that the software engineer wishes to optimize. It is argued that the multi-objective formulation is more realistic, since requirements engineering is characterised by the presence of many complex and conflicting demands, for which the software engineer must find a suitable balance. The paper presents the results of an empirical study into the suitability of weighted and Pareto optimal genetic algorithms, together with the NSGA-II algorithm, presenting evidence to support the claim that NSGA-II is well suited to the MONRP. The paper also provides benchmark data to indicate the size above which the MONRP becomes non–trivial.

Using an Adaptive Agent to Bid in a Simplified Model of the UK Market in Electricity.

The Cryptanalysis of a Three Rotor Machine Using a Genetic Algorithm.

